A discrete chicken swarm optimization for traveling salesman problem

نویسندگان

چکیده

Abstract Traveling Salesman Problem (TSP) is a typical combinatorial optimization problem, and it NP-hard problem. The total number of routes increases exponentially with the cities, so great significance to design an effective algorithm find optimal solution accurately. Chicken Swarm Optimization (CSO) new intelligent algorithm, which mainly proposed for continuous problems. It has advantages fast convergence speed high accuracy. This paper Discrete (DCSO) TSP. CSO discretized by introducing methods swap, order crossover reverse mutation, where search space enlarged, diversity increased. TSP models are simulated compared Basic Ant Colony Genetic Algorithm verify feasibility presented method.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Discrete Cat Swarm Optimization to Resolve the Traveling Salesman Problem

This research paper presents an adaptation of the cat swarm optimization (CSO) to solve the traveling salesman problem (TSP). This evolutionary algorithm appeared in 2007 by Chu and Tsai for optimization problems in the continuous case. To solve TSP, which is a discrete problem, we will describe the various operators and operations performed in two different modes of this algorithm, which is th...

متن کامل

Particle Swarm Optimization Algorithm for the Traveling Salesman Problem

Particle swarm optimization, PSO, is an evolutionary computation technique inspired in the behavior of bird flocks. PSO algorithms were first introduced by Kennedy & Eberhart (1995) for optimizing continuous nonlinear functions. The fundamentals of this metaheuristic approach rely on researches where the movements of social creatures were simulated by computers (Reeves, 1983; Reynolds, 1987; He...

متن کامل

An Improved Particle Swarm Optimization for Traveling Salesman Problem

To compensate for the shortcomings of existing methods used in TSP (Traveling Salesman Problem), such as the accuracy of solutions and the scale of problems, this paper proposed an improved particle swarm optimization by using a self-organizing construction mechanism and dynamic programming algorithm. Particles are connected in way of scale-free fully informed network topology map. Then dynamic...

متن کامل

Solve Traveling Salesman Problem Using Particle Swarm Optimization Algorithm

The traveling salesman problem (TSP) is one of the most widely studied NP-hard combinatorial optimization problems and traditional genetic algorithm trapped into the local minimum easily for solving this problem. Particle Swarm Optimization (PSO) algorithm was developed under the inspiration of behavior laws of bird flocks, fish schools and human communities. Compared with the genetic algorithm...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of physics

سال: 2021

ISSN: ['0022-3700', '1747-3721', '0368-3508', '1747-3713']

DOI: https://doi.org/10.1088/1742-6596/1978/1/012034